Symbolic and Structural Model-Checking

Brute-force model-checking consists in exhaustive exploration of the state-space a Petri net, and meets dreaded explosion problem. In contrast, this paper shows how to solve problems using combination techniques that stay complexity proportional size net structure rather than size. We combine an SMT based over-approximation prove some behaviors are unfeasible, under-approximation memory-less sampling runs find witness traces or counter-examples, set structural reduction rules can simplify both system property. This approach was able win by clear margin contest 2020 for reachability queries as well deadlock detection, thus demonstrating practical effectiveness general applicability presented paper.